On graphic arrangement groups

نویسندگان

چکیده

A finite simple graph ? determines a quotient P? of the pure braid group, called graphic arrangement group. We analyze homomorphisms these groups defined by deletion sets vertices, using methods developed in prior joint work with R. Randell. show that, for K4-free ?, product maps is injective, embedding free groups. Then residually free, torsion-free, torsion-free nilpotent, and acts properly on CAT(0) cube complex. also homological finiteness type Fm?1, but not Fm, where m number copies K3 except trivial cases. The result extended to graphs whose 4-cliques share at most one edge, giving an injection into corresponding maximal cliques ?. give examples showing that this map may inject more general circumstances. define group B? as natural extension automorphism extend our

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Special Properties of Graphic and Co-graphic Bondgraphs

The special combinatorial properties of graphic and co-graphic bondgraphs are analysed. A graphic bondgraph is one which has an associated graph, meaning that the two represent the same combinatorial information, expressed in thej’unctions of the bondgraph or the cycles of the graph. Dually a co-graphic bondgraph is one whose dual bondgraph has an associated graph. The combinatorial basis for c...

متن کامل

On the Arrangement Graph

The arrangement graph was proposed as a generalization of the star graph topology. In this paper we investigate the topological properties of the (n, k)-arrangement graph &k. It has been shown that the (n, n 2)arrangement graph An,+2 is isomorphic to the n-alternating group graph AGn In addition, the exact value of average distance of A,,& has been derived.

متن کامل

On Minimum Circular Arrangement

Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to find an embedding of a given weighted directed graph into a discrete circle which would minimize the total weighted arc length. Its decision version is already known to be NP-complete when restricted to sparse weighted dir...

متن کامل

Monolayer arrangement of fatty hydroxystearic 1 acids on graphite : Influence of hydroxyl groups

S. Medina , J. J. Benítez, M. A. Castro, C. Cerrillos, 3 C. Millán, M. D. Alba 4 Laboratorio de Rayos-X, Centro de Investigación Tecnología e Innovación 5 de la Universidad de Sevilla (CITIUS), Universidad de Sevilla, 6 Avenida Reina Mercedes, 4B. 41012 Sevilla. Spain. 7 Instituto de Ciencia de Materiales de Sevilla 8 Consejo Superior de Investigaciones Científicas-Universidad de Sevilla 9 Aven...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2021

ISSN: ['1090-2074', '0196-8858']

DOI: https://doi.org/10.1016/j.aam.2020.102130